关键词: 离散对数问题, 基于证书签名, 安全模型, 双线性对

Abstract:

A new certificate-based signature scheme is proposed. Assuming the intractability of discrete logarithm problem, the scheme proves to be secure in the strongest security model of certificate-based signature schemes. It requires general cryptographic Hash functions; with no need of any heavily cost bilinear pairing operations in its signing and verifying algorithms. So, it is of advantage of high computation efficiency, and can be used in some power-constrained devices, such as wireless sensor networks.

Key words: discrete logarithm problem, certificate-based signature, security model, bilinear pairing